4 research outputs found
Entanglement vs. gap for one-dimensional spin systems
We study the relationship between entanglement and spectral gap for local
Hamiltonians in one dimension. The area law for a one-dimensional system states
that for the ground state, the entanglement of any interval is upper-bounded by
a constant independent of the size of the interval. However, the possible
dependence of the upper bound on the spectral gap Delta is not known, as the
best known general upper bound is asymptotically much larger than the largest
possible entropy of any model system previously constructed for small Delta. To
help resolve this asymptotic behavior, we construct a family of one-dimensional
local systems for which some intervals have entanglement entropy which is
polynomial in 1/Delta, whereas previously studied systems, such as free fermion
systems or systems described by conformal field theory, had the entropy of all
intervals bounded by a constant times log(1/Delta).Comment: 16 pages. v2 is final published version with slight clarification
Can One Trust Quantum Simulators?
Various fundamental phenomena of strongly-correlated quantum systems such as
high- superconductivity, the fractional quantum-Hall effect, and quark
confinement are still awaiting a universally accepted explanation. The main
obstacle is the computational complexity of solving even the most simplified
theoretical models that are designed to capture the relevant quantum
correlations of the many-body system of interest. In his seminal 1982 paper
[Int. J. Theor. Phys. 21, 467], Richard Feynman suggested that such models
might be solved by "simulation" with a new type of computer whose constituent
parts are effectively governed by a desired quantum many-body dynamics.
Measurements on this engineered machine, now known as a "quantum simulator,"
would reveal some unknown or difficult to compute properties of a model of
interest. We argue that a useful quantum simulator must satisfy four
conditions: relevance, controllability, reliability, and efficiency. We review
the current state of the art of digital and analog quantum simulators. Whereas
so far the majority of the focus, both theoretically and experimentally, has
been on controllability of relevant models, we emphasize here the need for a
careful analysis of reliability and efficiency in the presence of
imperfections. We discuss how disorder and noise can impact these conditions,
and illustrate our concerns with novel numerical simulations of a paradigmatic
example: a disordered quantum spin chain governed by the Ising model in a
transverse magnetic field. We find that disorder can decrease the reliability
of an analog quantum simulator of this model, although large errors in local
observables are introduced only for strong levels of disorder. We conclude that
the answer to the question "Can we trust quantum simulators?" is... to some
extent.Comment: 20 pages. Minor changes with respect to version 2 (some additional
explanations, added references...
Quantum key distribution based on orthogonal states allows secure quantum bit commitment
For more than a decade, it was believed that unconditionally secure quantum
bit commitment (QBC) is impossible. But basing on a previously proposed quantum
key distribution scheme using orthogonal states, here we build a QBC protocol
in which the density matrices of the quantum states encoding the commitment do
not satisfy a crucial condition on which the no-go proofs of QBC are based.
Thus the no-go proofs could be evaded. Our protocol is fault-tolerant and very
feasible with currently available technology. It reopens the venue for other
"post-cold-war" multi-party cryptographic protocols, e.g., quantum bit string
commitment and quantum strong coin tossing with an arbitrarily small bias. This
result also has a strong influence on the Clifton-Bub-Halvorson theorem which
suggests that quantum theory could be characterized in terms of
information-theoretic constraints.Comment: Published version plus an appendix showing how to defeat the
counterfactual attack, more references [76,77,90,118-120] cited, and other
minor change
Quantum dice rolling: a multi-outcome generalization of quantum coin flipping
The problem of quantum dice rolling (DR)-a generalization of the problem of quantum coin flipping (CF) to more than two outcomes and parties-is studied in both its weak and strong variants. We prove by construction that quantum mechanics allows for (i) weak N-sided DR admitting arbitrarily small bias for any N and (ii) two-party strong N-sided DR saturating Kitaev's bound for any N. To derive (ii) we also prove by construction that quantum mechanics allows for (iii) strong imbalanced CF saturating Kitaev's bound for any degree of imbalance. Furthermore, as a corollary of (ii) we introduce a family of optimal 2m-party strong nm-sided DR protocols for any pair m and n. © IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.SCOPUS: ar.jinfo:eu-repo/semantics/publishe